An effective array beamforming scheme based on branch-and-bound algorithm

نویسندگان

چکیده

In this paper, we propose an effective full array and sparse adaptive beamforming scheme that can be applied for multiple desired signals based on the branch-and-bound algorithm. Adaptive is realized by improved Capon method. At same time, sidelobe constraint added to reduce level. To pointing errors of signals, response phase signal firstly optimized using auxilary variables while keeping amplitude unchanged. The whole design formulated as a convex optimization problem solved addition, beamformer weight vector penalized with modified reweighted ℓ 1 -norm achieve sparsity. Theoretical analysis simulation results show proposed algorithm has lower level, higher SINR, less error than state-of-the-art methods in case single expected signals.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Algorithm Based on Theory of Constraints and Branch and Bound for Solving Integrated Product-Mix-Outsourcing Problem

One of the most important decision making problems in many production systems is identification and determination of products and their quantities according to available resources. This problem is called product-mix. However, in the real-world situations, for existing constrained resources, many companies try to provide some products from external resources to achieve more profits. In this pape...

متن کامل

A Branch-and-bound Algorithm For Array Distributions

An important problem facing parallelizing compilers for distributed memory mimd machines is that of distributing data across processors. This distribution aaects the amout of data movements among processors that is required to execute the computations of the input program. This work proposes a branch{and{bound based method to automatically compute a distribution for the arrays of the input prog...

متن کامل

Computer simulation-based optimisation: hybrid branch and bound and orthogonal array-based enumeration algorithm

Branch and Bound method. This method is based on integration of orthogonal arrays and enumeration based techniques. Several observations are given supplemented with simple model solutions to verify our assumptions. The modified algorithm is valid for higher dimensional problems. The algorithm employs several 2-levels orthogonal arrays and the complexity of solutions is always of the order n 2. ...

متن کامل

An Asynchronous Branch-and-Bound DCOP Algorithm

Distributed constraint optimization (DCOP) problems are a popular way of formulating and solving agent-coordination problems. A DCOP problem is a problem where several agents coordinate their values such that the sum of the resulting constraint costs is minimal. It is often desirable to solve DCOP problems with memory-bounded and asynchronous algorithms. We introduce Branch-and-Bound ADOPT (BnB...

متن کامل

Phased array ultrasonic imaging using an improved beamforming based total focusing method for non destructive test

One of the novel ultrasonic phased array based scanning methods for ultrasonic imaging in non-destructive test is total focusing method (TFM). This method employs maximum available information of the phased array elements and leads to an improved defect detection accuracy compared to conventional scanning methods. Despite its high detection accuracy, TFM behaves weak in distinguishing the real ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Chinese Journal of Systems Engineering and Electronics

سال: 2022

ISSN: ['1004-4132']

DOI: https://doi.org/10.23919/jsee.2022.000123